Parallel optimization with boundary elements and kernel independent fast multipole method
نویسندگان
چکیده
منابع مشابه
A Fourier-series-based kernel-independent fast multipole method
We present in this paper a new kernel-independent fast multipole method (FMM), named as FKI-FMM, for pairwise particle interactions with translation-invariant kernel functions. FKI-FMM creates, using numerical techniques, sufficiently accurate and compressive representations of a given kernel function over multi-scale interaction regions in the form of a truncated Fourier series. It provides al...
متن کاملAn Accelerated Kernel-Independent Fast Multipole Method in One Dimension
A version of the fast multipole method (FMM) is described for charge distributions on the line. Previously published schemes of this type relied either on analytical representations of the potentials to be evaluated (multipoles, Legendre expansions, Taylor series, etc.) or on tailored representations that were constructed numerically (using, e.g., the singular value decomposition (SVD), artific...
متن کاملParallel Fast Multipole Boundary Element Method for Crustal Dynamics
Crustal faults and sharp material transitions in the crust are usually represented as triangulated surfaces in structural geological models. The complex range of volumes separating such surfaces is typically three-dimensionally meshed in order to solve equations that describe crustal deformation with the finite-difference (FD) or finite-element (FEM) methods. We show here how the Boundary Eleme...
متن کاملA kernel-independent fast multipole algorithm
We present a new fast multipole method for particle simulations. The main feature of our algorithm is that is kernel independent, in the sense that no analytic expansions are used to represent the far field. Instead we use equivalent densities, which we compute by solving small Dirichlet-type boundary value problems. The translations from the sources to the induced potentials are accelerated by...
متن کاملA Provably Optimal, Distribution-Independent Parallel Fast Multipole Method
The Fast Multipole Method (FMM) is a robust technique for the rapid evaluation of the combined e ect of pairwise interactions of n data sources. Parallel computation of the FMM is considered a challenging problem due to the dependence of the computation on the distribution of the data sources, usually resulting in dynamic data decomposition and load balancing problems. In this paper, we present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Methods and Experimental Measurements
سال: 2017
ISSN: 2046-0546,2046-0554
DOI: 10.2495/cmem-v5-n2-154-162